332. Reconstruct Itinerary - LeetCode Solution


Depth-first Search Graph

Python Code:

class Solution:
    def findItinerary(self, tickets: List[List[str]]) -> List[str]:
        def d(c):
            while(len(g[c]) > 0):
                d(g[c].pop(0))
            r.insert(0, c) 
            
        g = collections.defaultdict(list)
        for u, v in (tickets):
            
            g[u].append(v)
            
            g[u].sort()
            
        r=[]      
        
        d("JFK")
        
        return r
        


Comments

Submit
0 Comments
More Questions

119A - Epic Game
703A - Mishka and Game
1504C - Balance the Bits
988A - Diverse Team
1312B - Bogosort
1616B - Mirror in the String
1660C - Get an Even String
489B - BerSU Ball
977C - Less or Equal
1505C - Fibonacci Words
1660A - Vasya and Coins
1660E - Matrix and Shifts
1293B - JOE is on TV
1584A - Mathematical Addition
1660B - Vlad and Candies
1472C - Long Jumps
1293D - Aroma's Search
918A - Eleven
1237A - Balanced Rating Changes
1616A - Integer Diversity
1627B - Not Sitting
1663C - Pōja Verdon
1497A - Meximization
1633B - Minority
688B - Lovely Palindromes
66B - Petya and Countryside
1557B - Moamen and k-subarrays
540A - Combination Lock
1553C - Penalty
1474E - What Is It